OPTIMAL SHRINKAGE OF SINGULAR VALUES By
نویسندگان
چکیده
We consider recovery of low-rank matrices from noisy data by shrinkage of singular values, in which a single, univariate nonlinearity is applied to each of the empirical singular values. We adopt an asymptotic framework, in which the matrix size is much larger than the rank of the signal matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. For a variety of loss functions, including the Frobenius norm loss (MSE), nuclear norm loss and operator norm loss, we show that in this framework there is a well-defined asymptotic loss that we evaluate precisely in each case. In fact, each of the loss functions we study admits a unique admissible shrinkage nonlinearity dominating all other nonlinearities. We provide a general method for evaluating these optimal nonlinearities, and demonstrate it by working out explicit formulas for the optimal nonlinearities in the Frobenius, nuclear and operator norm cases.
منابع مشابه
Optimal Shrinkage of Singular Values Under Random Data Contamination
A low rank matrixX has been contaminated by uniformly distributed noise, missing values, outliers and corrupt entries. Reconstruction of X from the singular values and singular vectors of the contaminated matrix Y is a key problem in machine learning, computer vision and data science. In this paper, we show that common contamination models (including arbitrary combinations of uniform noise, mis...
متن کاملGeneralized SURE for optimal shrinkage of singular values in low-rank matrix denoising
We consider the problem of estimating a low-rank signal matrix from noisy measurements under the assumption that the distribution of the data matrix belongs to an exponential family. In this setting, we derive generalized Stein’s unbiased risk estimation (SURE) formulas that hold for any spectral estimators which shrink or threshold the singular values of the data matrix. This leads to new data...
متن کاملTHE OPTIMAL HARD THRESHOLD FOR SINGULAR VALUES IS 4/√3 By
We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, in which empirical singular values below a prescribed threshold λ are set to 0. We study the asymptotic MSE (AMSE) in a framework where the matrix size is large compared to the rank of the matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. The AMSE-optimal ...
متن کاملThe Optimal Hard Threshold for Singular Values is 4 / √ 3
We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, in which empirical singular values below a threshold λ are set to 0. We study the asymptotic MSE (AMSE) in a framework where the matrix size is large compared to the rank of the matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. The AMSE-optimal choice of h...
متن کاملMinimal Shrinkage for Noisy Data Recovery Using Schatten-p Norm Objective
Noisy data recovery is an important problem in machine learning field, which has widely applications for collaborative prediction, recommendation systems, etc. One popular model is to use trace norm model for noisy data recovery. However, it is ignored that the reconstructed data could be shrank (i.e., singular values could be greatly suppressed). In this paper, we present novel noisy data reco...
متن کامل